Synthesis of Hazard Free Asynchronous Circuits from Signal Transition Graphs

نویسندگان

  • Rahul Balani
  • Supratik Chakraborty
چکیده

Asynchronous systems can be modelled as concurrent systems in which events are in terepreted as signal transitions The synthesis of concurrent systems implies the analysis of a vast state space that often requires computationally expensive methods The circuits are speci ed by free choice signal transition graphs STG s a subclass of interpreted Petri nets This report analyses and compares the various methods for synthesis of Speed independent circuits based on the STG s

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Algorithms for the Synthesis of Hazard-free Circuits from Signal Transition Graphs

Methods for the synthesis of asynchronous circuits from Signal Transition Graphs (STGs) have commonly used the State Graph to solve the two main steps of this process: the state assignment problem and the generation of hazard-free logic. The size of the State Graph can be of order O(2 n), where n is the number of signals of the circuit. As synthesis tools for asynchronous systems start to matur...

متن کامل

Polynomial Algorithms for Complete State Coding and Synthesis of Hazard-free Circuits from Signal Transition Graphs

Methods for the synthesis of asynchronous circuits from Signal Transition Graphs (STGs) have commonly used the State Graph to solve the two main steps of this process: the state assignment problem and the generation of hazard-free logic. The size of the State Graph can be of order O(2 n), where n is the number of signals of the circuit. As synthesis tools for asynchronous systems start to matur...

متن کامل

Signal Transition Graph Constraints for Synthesis of Hazard-Free Asynchronous Circuits with Unbounded-Gate Delays

A synthesis procedure for asynchronous control circuits from a high level speci cation signal transition graph STG is described In this paper we propose some syntactic constraints on STG to guarantee hazard free im plementation We have introduced a global persistency concept in order to establish the relationship between the persistency concept introduced by Chu which we call local persistency ...

متن کامل

Achilles: A High-Level Synthesis System for Asynchronous Circuits

This paper presents Achilles, a High-Level Synthesis System for asynchronous digital circuits. A new architecture model based on a completely distributed control structure is proposed. The most relevant diierences from synthesis systems for synchronous circuits appear in the phases of scheduling and synthesis of the control. Signal Transition Graphs are automatically generated to describe the b...

متن کامل

A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs

Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Checking this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006